APPROXIMATING NASH EQUILIBRIA IN NONZERO-SUM GAMES
نویسندگان
چکیده
منابع مشابه
Approximating Nash Equilibria in nonzero-Sum Games
This paper deals with the approximation of Nash-equilibria in m-player games. We present conditions under which an approximating sequence of games admits near-equilibria that approximate near equilibria in the limit game. We apply the results to two classes of games: (i) a duopoly game approximated by a sequence of matrix games; (ii) a stochastic game played under the S-adapted information stru...
متن کاملApproximating Nash Equilibria in Tree Polymatrix Games
We develop a quasi-polynomial time Las Vegas algorithm for approximating Nash equilibria in polymatrix games over trees, under a mild renormalizing assumption. Our result, in particular, leads to an expected polynomial-time algorithm for computing approximate Nash equilibria of tree polymatrix games in which the number of actions per player is a fixed constant. Further, for trees with constant ...
متن کاملNash Equilibria in General Sum Games
In this lecture we study basic solution concepts in game theory, namely the notion of dominant strategy and Nash equilibrium. We consider rational players in a competitive environment. A rational player is a player with priorities (or utility) that tries to maximize the utility (or minimize cost) while considering that other players are also rational. A competitive environment is an environment...
متن کاملNash equilibria of threshold type for two-player nonzero-sum games of stopping
This paper analyses two-player nonzero-sum games of optimal stopping on a class of regular diffusions with singular boundary behaviour (in the sense of Itô and McKean (1974) [19], p. 108). We prove that Nash equilibria are realised by stopping the diffusion at the first exit time from suitable intervals whose boundaries solve a system of algebraic equations. Under mild additional assumptions we...
متن کاملTeaching Nonzero Sum Games Using a Diagrammatic Determination of Equilibria
W present a diagrammatic method that allows the determination of all Nash equilibria of 2×M nonzero sum games, extending thus the well known diagrammatic techniques for 2 × M zero sum and 2 × 2 nonzero sum games. We show its appropriateness for teaching purposes by analyzing modified versions of the prisoners’ dilemma, the battle of the sexes, as well as of the zero sum game of matching pennies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Game Theory Review
سال: 2000
ISSN: 0219-1989,1793-6675
DOI: 10.1142/s0219198900000123